Refinements and Randomised Versions of Some Tournament Solutions
نویسندگان
چکیده
We consider voting rules that are based on the majority graph. Such rules typically output large sets of winners. Our goal is to investigate a general method which leads to refinements of such rules. In particular, we use the idea of parallel universes, where each universe is connected with a permutation over alternatives. The permutation allows us to construct resolute voting rules (i.e. rules that always choose unique winners). Such resolute rules can be constructed in a variety of ways: we consider using binary voting trees to select a single alternative. In turn this permits the construction of neutral rules that output the set the possible winners of every parallel universe. The question of which rules can be constructed in this way has already been partially studied under the heading of agenda implementability. We further propose a randomised version in which the probability of being the winner is the ratio of universes in which the alternative wins. We also investigate (typically novel) rules that elect the alternatives that have maximal winning probability. These rules typically output small sets of winners, thus provide refinements of known tournament solutions.
منابع مشابه
Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule
Various Condorcet consistent social choice functions based on majority rule (tournament solutions) are considered in the general case, when ties are allowed: the core, the weak and strong top cycle sets, versions of the uncovered and minimal weakly stable sets, the uncaptured set, the untrapped set, classes of k-stable alternatives and k-stable sets. The main focus of the paper is to construct ...
متن کاملcomparison between to versions of the SAFT EOS in the study of PVT and VLE phase behavior of pure polymer melts and binary polymer solutions
متن کامل
Efficient Simulation of a Random Knockout Tournament
We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimato...
متن کاملRefinements of spectral resolutions and modelling of operators in II1 factors
We study refinements between spectral resolutions in an arbitrary II1 factor M and obtain diffuse (maximal) refinements of spectral resolutions. We construct models of operators with respect to diffuse spectral resolutions. As an application we obtain new characterizations of submajorization and spectral preorder between positive operators in M and new versions of some known inequalities involv...
متن کاملMaximizing breaks and bounding solutions to the mirrored traveling tournament problem
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization problem are equivalent when the distance between every pair of teams is equal to 1. We show how to construct schedules with a maximum number of breaks for some tournament types. The connection between breaks maximizati...
متن کامل